Termination fees revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Termination fees in mergers and acquisitions

The paper examines the motivation for termination fee use by proving evidence on the effects of including a target termination fee in a merger contract. I test the implications of the hypothesis that termination fees are used by self-interested target managers to deter competing bids and protect “sweetheart” deals with white knight bidders, presumably resulting in lower premiums for target shar...

متن کامل

Hierarchical termination revisited

During the past two decades, term rewriting has gained enormous importance in various fields of computer science. Among other things, term rewriting constitutes a Turing-complete computational model which is closely related to functional programming. In other words, term rewriting systems (TRSs) can be viewed as programs. It is a well-known programming paradigm in computer science that programs...

متن کامل

Termination of narrowing revisited

This paper describes several classes of term rewriting systems (TRS’s) where narrowing has a finite search space and is still (strongly) complete as a mechanism for solving reachability goals. These classes do not assume confluence of the TRS. We also ascertain purely syntactic criteria that suffice to ensure the termination of narrowing and include several subclasses of popular TRS’s such as r...

متن کامل

Simple Termination Revisited

In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpliication order. The basic ingredient of a simpliication order is the subterm property, but in the literature two diierent deenitions are given: one based on (strict) partial orders and another one based on preorders (or quasi-or...

متن کامل

Termination of Lazy Rewriting Revisited

Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to context-sensitive rewriting, reductions at such argument positions are not completely forbidden but delayed. Based on the observation that the only existing (non-trivial) approach to prove termination of such lazy rewr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Industrial Organization

سال: 2013

ISSN: 0167-7187

DOI: 10.1016/j.ijindorg.2013.05.006